Optimal extended optical flow subject to a statistical constraint
نویسندگان
چکیده
منابع مشابه
Optimal Filters for Extended Optical Flow
Estimation of optical flow and physically motivated brightness changes can be formulated as parameter estimation in linear models. Accuracy of this estimation heavily depends on the filter families used to implement the models. In this paper we focus on models whose terms are all data dependent and therefore are best estimated via total-least-squares (TLS) or similar estimators. Using three dif...
متن کاملStructure of optimal transport networks subject to a global constraint.
The structure of pipe networks minimizing the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can be built with a given total pipe volume (or pipe lateral surface area), the network which minimizes the dissipation rate is shown to be loopless. Furthermore, such an optimal network is shown to contain at most N-2 nodes in addition to the N sources ...
متن کاملMaximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Let f : 2 → R be a non-decreasing submodular set function, and let (N, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2-approximation [9] for this problem. It is also known, via a reduction from the max-k-cover problem, that there is no (1− 1/e+ )-approximation for any constant > 0, unless P = NP [6]. In this paper, we improve the 1/2-appr...
متن کاملKnapsack Cover Subject to a Matroid Constraint
We consider the Knapsack Covering problem subject to a matroid constraint. In this problem, we are given an universe U of n items where item i has attributes: a cost c(i) and a size s(i). We also have a demand D. We are also given a matroid M = (U, I) on the set U . A feasible solution S to the problem is one such that (i) the cumulative size of the items chosen is at least D, and (ii) the set ...
متن کاملOptimal stock allocation in single echelon inventory systems subject to a service constraint
number: 011-0137 Optimal stock allocation in single echelon inventory systems subject to a service constraint Annalisa Cesaro • Dario Pacciarelli • Dipartimento di Informatica e Automazione, Università Roma Tre, Via della Vasca Navale, 79, Rome I-00146, Italy [email protected] • [email protected] • phone:0039-06-57333394 POMS 20th Annual Conference Orlando, Florida U.S.A. May 1 t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.10.014